MozartV1, France, Analysis, bibRecord, 000038

Polyphonic Alignment Algorithms for Symbolic Music Retrieval

Identifieur interne : 000038 ( France/Analysis ); précédent : 000037; suivant : 000039

Polyphonic Alignment Algorithms for Symbolic Music Retrieval

Auteurs : Julien Allali [France, Canada] ; Pascal Ferraro [France, Canada] ; Pierre Hanna [France] ; Matthias Robine [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.

RBID : ISTEX:E39633198A449859E4F871A9150E0F1482FB8785

Abstract

Abstract: Melody is an important property for the perceptual description of Western musical pieces. A lot of applications rely on the evaluation of similarity between two melodies. While several existing techniques assume a monophonic context or extract a monophonic melody from polyphonic pieces, in this paper, we propose to consider the whole polyphonic context to evaluate the similarity without reducing to a monophonic melody. We thus propose a new model and a corresponding methodology that takes into account all the notes, even if they sound at the same time or if they overlap. Our model relies on a quotiented sequence representation of music. A quotiented sequence is a sequence graph defined with an additional equivalent relation on its vertices and such that the quotient graph is also a sequence graph. The core of the comparison method is based on an adaptation of edit-distance metrics, regularly applied in bio-informatic context. This algorithm is currently being used to evaluate the similarity between a monophonic or polyphonic query and a database of polyphonic musical pieces. First experiments show that the adaptation to polyphony does not degrade the quality of the algorithm with monophonic musical pieces. Furthermore, the results of experiments with polyphonic pieces are promising, even if they show some limitations.

Url:

https://api.istex.fr/document/E39633198A449859E4F871A9150E0F1482FB8785/fulltext/pdf

DOI: 10.1007/978-3-642-12439-6_24

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 001566
to stream Istex, to step Curation: 001222
to stream Istex, to step Checkpoint: 000423
to stream Main, to step Merge: 000921
to stream Main, to step Curation: 000918
to stream Main, to step Exploration: 000918
to stream France, to step Extraction: 000038

Links to Exploration step

ISTEX:E39633198A449859E4F871A9150E0F1482FB8785

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Polyphonic Alignment Algorithms for Symbolic Music Retrieval</title>
<author><name sortKey="Allali, Julien" sort="Allali, Julien" uniqKey="Allali J" first="Julien" last="Allali">Julien Allali</name>
</author>
<author><name sortKey="Ferraro, Pascal" sort="Ferraro, Pascal" uniqKey="Ferraro P" first="Pascal" last="Ferraro">Pascal Ferraro</name>
</author>
<author><name sortKey="Hanna, Pierre" sort="Hanna, Pierre" uniqKey="Hanna P" first="Pierre" last="Hanna">Pierre Hanna</name>
</author>
<author><name sortKey="Robine, Matthias" sort="Robine, Matthias" uniqKey="Robine M" first="Matthias" last="Robine">Matthias Robine</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:E39633198A449859E4F871A9150E0F1482FB8785</idno>
<date when="2010" year="2010">2010</date>
<idno type="doi">10.1007/978-3-642-12439-6_24</idno>
<idno type="url">https://api.istex.fr/document/E39633198A449859E4F871A9150E0F1482FB8785/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001566</idno>
<idno type="wicri:Area/Istex/Curation">001222</idno>
<idno type="wicri:Area/Istex/Checkpoint">000423</idno>
<idno type="wicri:doubleKey">0302-9743:2010:Allali J:polyphonic:alignment:algorithms</idno>
<idno type="wicri:Area/Main/Merge">000921</idno>
<idno type="wicri:Area/Main/Curation">000918</idno>
<idno type="wicri:Area/Main/Exploration">000918</idno>
<idno type="wicri:Area/France/Extraction">000038</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Polyphonic Alignment Algorithms for Symbolic Music Retrieval</title>
<author><name sortKey="Allali, Julien" sort="Allali, Julien" uniqKey="Allali J" first="Julien" last="Allali">Julien Allali</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>LaBRI, Université de Bordeaux, 33405, Talence cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Aquitaine-Limousin-Poitou-Charentes</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
<orgName type="university">Université de Bordeaux</orgName>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">Canada</country>
<wicri:regionArea>Pacific Institute For the Mathematical Sciences, Simon Fraser University</wicri:regionArea>
<wicri:noRegion>Simon Fraser University</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Ferraro, Pascal" sort="Ferraro, Pascal" uniqKey="Ferraro P" first="Pascal" last="Ferraro">Pascal Ferraro</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>LaBRI, Université de Bordeaux, 33405, Talence cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Aquitaine-Limousin-Poitou-Charentes</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
<orgName type="university">Université de Bordeaux</orgName>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">Canada</country>
<wicri:regionArea>Pacific Institute For the Mathematical Sciences, University of Calgary</wicri:regionArea>
<wicri:noRegion>University of Calgary</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Hanna, Pierre" sort="Hanna, Pierre" uniqKey="Hanna P" first="Pierre" last="Hanna">Pierre Hanna</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>LaBRI, Université de Bordeaux, 33405, Talence cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Aquitaine-Limousin-Poitou-Charentes</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
<orgName type="university">Université de Bordeaux</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Robine, Matthias" sort="Robine, Matthias" uniqKey="Robine M" first="Matthias" last="Robine">Matthias Robine</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>LaBRI, Université de Bordeaux, 33405, Talence cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Aquitaine-Limousin-Poitou-Charentes</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
<orgName type="university">Université de Bordeaux</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2010</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
</series>
<idno type="istex">E39633198A449859E4F871A9150E0F1482FB8785</idno>
<idno type="DOI">10.1007/978-3-642-12439-6_24</idno>
<idno type="ChapterID">Chap24</idno>
<idno type="ChapterID">24</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Melody is an important property for the perceptual description of Western musical pieces. A lot of applications rely on the evaluation of similarity between two melodies. While several existing techniques assume a monophonic context or extract a monophonic melody from polyphonic pieces, in this paper, we propose to consider the whole polyphonic context to evaluate the similarity without reducing to a monophonic melody. We thus propose a new model and a corresponding methodology that takes into account all the notes, even if they sound at the same time or if they overlap. Our model relies on a quotiented sequence representation of music. A quotiented sequence is a sequence graph defined with an additional equivalent relation on its vertices and such that the quotient graph is also a sequence graph. The core of the comparison method is based on an adaptation of edit-distance metrics, regularly applied in bio-informatic context. This algorithm is currently being used to evaluate the similarity between a monophonic or polyphonic query and a database of polyphonic musical pieces. First experiments show that the adaptation to polyphony does not degrade the quality of the algorithm with monophonic musical pieces. Furthermore, the results of experiments with polyphonic pieces are promising, even if they show some limitations.</div>
</front>
</TEI>
<affiliations><list><country><li>Canada</li>
<li>France</li>
</country>
<region><li>Aquitaine</li>
<li>Aquitaine-Limousin-Poitou-Charentes</li>
</region>
<settlement><li>Talence</li>
</settlement>
<orgName><li>Université de Bordeaux</li>
</orgName>
</list>
<tree><country name="France"><region name="Aquitaine-Limousin-Poitou-Charentes"><name sortKey="Allali, Julien" sort="Allali, Julien" uniqKey="Allali J" first="Julien" last="Allali">Julien Allali</name>
</region>
<name sortKey="Allali, Julien" sort="Allali, Julien" uniqKey="Allali J" first="Julien" last="Allali">Julien Allali</name>
<name sortKey="Ferraro, Pascal" sort="Ferraro, Pascal" uniqKey="Ferraro P" first="Pascal" last="Ferraro">Pascal Ferraro</name>
<name sortKey="Ferraro, Pascal" sort="Ferraro, Pascal" uniqKey="Ferraro P" first="Pascal" last="Ferraro">Pascal Ferraro</name>
<name sortKey="Hanna, Pierre" sort="Hanna, Pierre" uniqKey="Hanna P" first="Pierre" last="Hanna">Pierre Hanna</name>
<name sortKey="Hanna, Pierre" sort="Hanna, Pierre" uniqKey="Hanna P" first="Pierre" last="Hanna">Pierre Hanna</name>
<name sortKey="Robine, Matthias" sort="Robine, Matthias" uniqKey="Robine M" first="Matthias" last="Robine">Matthias Robine</name>
<name sortKey="Robine, Matthias" sort="Robine, Matthias" uniqKey="Robine M" first="Matthias" last="Robine">Matthias Robine</name>
</country>
<country name="Canada"><noRegion><name sortKey="Allali, Julien" sort="Allali, Julien" uniqKey="Allali J" first="Julien" last="Allali">Julien Allali</name>
</noRegion>
<name sortKey="Ferraro, Pascal" sort="Ferraro, Pascal" uniqKey="Ferraro P" first="Pascal" last="Ferraro">Pascal Ferraro</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/France/Analysis

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000038 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000038 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    France
   |étape=   Analysis
   |type=    RBID
   |clé=     ISTEX:E39633198A449859E4F871A9150E0F1482FB8785
   |texte=   Polyphonic Alignment Algorithms for Symbolic Music Retrieval
}}

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023

	Serveur d'exploration sur Mozart
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur Mozart

Polyphonic Alignment Algorithms for Symbolic Music Retrieval

Polyphonic Alignment Algorithms for Symbolic Music Retrieval

Source :

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri